THE LEAST SINGULAR VALUE OF A RANDOM SQUARE MATRIX IS O(n) MARK RUDELSON AND ROMAN VERSHYNIN

نویسندگان

  • MARK RUDELSON
  • ROMAN VERSHYNIN
چکیده

Let A be a matrix whose entries are real i.i.d. centered random variables with unit variance and suitable moment assumptions. Then the smallest singular value sn(A) is of order n −1/2 with high probability. The lower estimate of this type was proved recently by the authors; in this note we establish the matching upper estimate.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Smallest Singular Value of a Random Rectangular Matrix Mark Rudelson and Roman Vershynin

We prove an optimal estimate of the smallest singular value of a random subgaussian matrix, valid for all dimensions. For an N × n matrix A with independent and identically distributed subgaussian entries, the smallest singular value of A is at least of the order √ N − √ n − 1 with high probability. A sharp estimate on the probability is also obtained.

متن کامل

The Smallest Singular Value of a Random Rectangular Matrix

We prove an optimal estimate on the smallest singular value of a random subgaussian matrix, valid for all fixed dimensions. For an N × n matrix A with independent and identically distributed subgaussian entries, the smallest singular value of A is at least of the order √ N − √ n − 1 with high probability. A sharp estimate on the probability is also obtained.

متن کامل

Smallest Singular Value of a Random Rectangular Matrix

We prove an optimal estimate of the smallest singular value of a random subGaussian matrix, valid for all dimensions. For an N n matrix A with independent and identically distributed sub-Gaussian entries, the smallest singular value of A is at least of the order p N pn 1 with high probability. A sharp estimate on the probability is also obtained. © 2009 Wiley Periodicals, Inc.

متن کامل

Non-asymptotic theory of random matrices: extreme singular values

The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to information theory operate with random matrices in fixed dimensions. This survey addresses the non-asymptotic theory of extreme singular values of random matrices w...

متن کامل

Spectral Norm of Products of Random and Deterministic Matrices

We study the spectral norm of matrices W that can be factored as W = BA, where A is a random matrix with independent mean zero entries and B is a fixed matrix. Under the (4 + ε)-th moment assumption on the entries of A, we show that the spectral norm of such an m×n matrix W is bounded by √ m + √ n, which is sharp. In other words, in regard to the spectral norm, products of random and determinis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008